Other Paths to Faster Pulses
نویسندگان
چکیده
منابع مشابه
Reconstructing edge-disjoint paths faster
For a simple undirected graph with n vertices and m edges, we consider a data structure that given a query of a pair of vertices u, v and an integer k ≥ 1, it returns k edge-disjoint uv-paths. The data structure takes Õ(n) time to build, using O( √ mn log n) space, and each query takes O( √ kn) time, which is optimal and beats the previous query time of O(knα(n)).
متن کاملPeerWise Discovery and Negotiation of Faster Paths
Routing overlays have the potential to circumvent Internet pathologies to construct faster or more reliable paths. We suggest that overlay routing protocols have yet to become ubiquitous because they do not incorporate mechanisms for finding and negotiating with mutually advantageous peers: nodes in the overlay that can benefit equally from each other. We show that mutually advantageous peers e...
متن کاملFaster Genetic Algorithm for Network Paths∗
Through analyzing the algorithm presented by Mitsuo.Gen, and taking into account the schema theorem and the architecture block hypothesis of a genetic algorithm, we showed some flaws in Mitsuo.Gen algorithm in this paper. A better genetic algorithm for solving shortest path problems is presented further, which is based on the technology of dynamic coding of the priority of vertex and gene weigh...
متن کاملFaster Batched Shortest Paths in Road Networks
We study the problem of computing batched shortest paths in road networks efficiently. Our focus is on computing paths from a single source to multiple targets (one-to-many queries). We perform a comprehensive experimental comparison of several approaches, including new ones. We conclude that a new extension of PHAST (a recent one-to-all algorithm), called RPHAST, has the best performance in mo...
متن کاملQuickest Paths: Faster Algorithms and Dynamization
Given a network N = (V,E, c, l), where G = (V,E), |V | = n and |E| = m, is a directed graph, c(e) > 0 is the capacity and l(e) ≥ 0 is the lead time (or delay) for each edge e ∈ E, the quickest path problem is to find a path for a given source–destination pair such that the total lead time plus the inverse of the minimum edge capacity of the path is minimal. The problem has applications to fast ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 1995
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.269.5224.635